-
1 эвристическая аппроксимация
Русско-английский научно-технический словарь Масловского > эвристическая аппроксимация
-
2 эвристическая аппроксимация
Mathematics: heuristic approximationУниверсальный русско-английский словарь > эвристическая аппроксимация
-
3 метод
чmethod, procedure, tool, means; practice, techinqueефективний метод — effective method, powerful/proficient method
індуктивний метод — inductive method, objective method, induction
метод аналогій — analog approach, analog method
метод занурення — immersion method, immersion technique/procedure
метод перевірки — checking method, method of verification, test procedure, check method, test method
метод прогнозування — forecasting approach, forecast method
метод спроб і помилок — trial-and-error ( cut-and-try) method
методи управління — management technique, management techniques
См. также в других словарях:
Nearest Insertion Heuristic — Nearest Insertion Heuristik Die Nearest Insertion Heuristik (NEARIN), ist eine Einfüge Heuristik und damit ein heuristisches Eröffnungsverfahren aus der Graphentheorie. Es dient zur Approximation einer guten Lösung des Problem des… … Deutsch Wikipedia
Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
nature, philosophy of — Introduction the discipline that investigates substantive issues regarding the actual features of nature as a reality. The discussion here is divided into two parts: the philosophy of physics and the philosophy of biology. In this… … Universalium
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Collatz conjecture — Directed graph showing the orbits of small numbers under the Collatz map. The Collatz conjecture is equivalent to the statement that all paths eventually lead to 1 … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia